منابع مشابه
Remarks on continuum cardinals on Boolean algebras
For set-theoretical notation we follow [3]. We follow [2] for Boolean algebraic notation, and Monk [5] for more specialized notation concerning cardinal functions on Boolean algebras. Fr(κ) is the free Boolean algebra on κ generators. A is the completion of A. If L is a linear order, then Intalg(L) is the interval algebra over L (perhaps after adjoining a first element to L). Any element x of I...
متن کاملSome Remarks on Boolean Constraint Propagation
We study here the well-known propagation rules for Boolean constraints. First we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between Boolean constraint propagation and unit propagation, a form of resolution for propositional logic. Subsequently we characterize one set of such rules by mea...
متن کاملOn canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملVarious Remarks on Univalent Functions
Let F„ denote the wth coefficient region for this class of functions [S, §1.2]. Let F=Fia2, ä2, ■ • ■ , a„, a«) be a real-valued function. Write x,= (l/2)(a,+á,), y,= (l/2í)(a,-á,), F,= (l/2)(r3F/r)x, — idF/dy,). Let F satisfy the further conditions (a) F is defined in an open set O containing V„, (b) F and its derivatives F, are continuous in 0, (c) |grad F\ = ( E?-a | F,\ 2)1/2>0 in 0. Let/(z...
متن کاملOn Learning Monotone Boolean Functions
Abstract We consider the problem of learning monotone Boolean functions over under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function , and given polynomial computing time, we would like to approximate as well as possible. We describe a simple algorithm that we prove achieves error at most , improving on the previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1953
ISSN: 0025-5645
DOI: 10.2969/jmsj/00530345